Dynamic Coded Caching in Wireless Networks

We consider distributed and dynamic caching of coded content at small base stations (SBSs) in an area served by a macro station (MBS). Specifically, is encoded using maximum distance separable code cached according to time-to-live (TTL) cache eviction policy, which allows packets be removed from the caches periodic times. Mobile users requesting particular download SBSs within communication range. If additional are required decode file, these downloaded MBS. formulate optimization problem that efficiently solved numerically, providing TTL policies minimizing overall network load. demonstrate can offer significant reductions terms load when request arrivals bursty. show how utilizing analyzed as specific single cache, convex problem. Our encompasses static special cases. prove that, interestingly, optimal under Poisson process, for has surprisingly simple solution.